Cosmic Ray Report

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183b6b9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fb3d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183dda380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e076a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e363b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e05330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e7dd80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e4b580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183dd9240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e49360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fdbe20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fb1f60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183b680d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e49db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fdada0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fb05e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fd8790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183fb0f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e48b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3184112d40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3183e51cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" - leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108a6fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108e33310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108cf14b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108d3f7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eb5330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108d3c760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6109016320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108b1e4d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6109016e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eea110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eb4c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108a6df60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eb7580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108ee83a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6109016170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108b1d840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eb5780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108b1e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108df3850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108bc1990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6108eea860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS - " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccc878e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd0cc5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd109360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccfc39d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd016320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccfc0b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccc86950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd0de0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccd316c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd108160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccd33fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccf092a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccd32140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccf1ffa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccfc2950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccf0beb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd0cff40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccf0b880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccc7a080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7ccf1cd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb7cd0dc610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " - str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44b938e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44fd85b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed45015360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44f23a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44f06320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44f20130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44b92950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44fea0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44c3d6c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed45014160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44c3ffd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44e152a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44c3e140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44e63ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44f22a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44e17eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44fdbf40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44e14640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44b8a470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44e613f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed44feb940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) - " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ac8af8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14accf7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acb145e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acc1f160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acbdead0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acc1d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ace566e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14aca7f6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14accf4a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acd0f010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14accf6d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acb358a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ac95e230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acd0df90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14accf49d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ac8ad090>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14accf5390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ac8ad690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acd07be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14acb171f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f14ac96f430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" - rightS + ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe7838c3b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d088b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b42da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b90f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d0b040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b909d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d37a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d44790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d1b790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b93940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d0af20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783c15ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b7a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d45a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d0aaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783e69ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d0aa40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b93670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783d44340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe78396e140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fe783b40be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS - ")"
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" - str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb65066350>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb65046290>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb64cbb7f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb651bace0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb650583d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb651ba8f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb65059d80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb64c13af0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb65059810>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb64cc47c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb64ed9120>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for -: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fdb650665f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" - str(self.root)
E       TypeError: unsupported operand type(s) for -: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a5c3b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907ab10a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a834f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa36a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a5b5420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a66dae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907ab6a560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa19840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a66f520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a855cf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a66f4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa36d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a8d4400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa34640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a5b6350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa36b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa47d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa34760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907aa063b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a836f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f907a895d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" * leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988633baf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988677d900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98865ab370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98867ae590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988632cc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98867ac910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98868e27d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9886791720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98868e3df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98863f5db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98865c16c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988677e260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9886792650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98863f4fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988632ffa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9886339a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988632f430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f988633a680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9886645f30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98865db520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f98868e2920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS * " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f722ba00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f7673010>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74892a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74ff1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f754e260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74fedd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f758dc30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f72d7490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f754dd20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f72d7220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74895a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f769d4b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74f9150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f72d7760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74f8be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f72d6800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74f8310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f72d4d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f7672e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f74fc040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f94f769c730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " * str(self.value) + " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a8239d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac78580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6aabc5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a97b700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6aba2a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a9792a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ab52ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6aad76a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a822a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a979390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a8e2620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac88370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a8d36a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac7b430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a8e3ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac7a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a8e31c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac78580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6a97ae00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6aabdf00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f9e6ac888b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) * " R:" + rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcd4b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcd40e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcfd1960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd0880a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd002320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd089d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcdf4e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd1bc9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd000a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fce05150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcfd24d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd1bdab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd01b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fce04520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd01a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcfd11e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd019690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fcfd31f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd1bc9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd1a3ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7fb6fd2f24d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" * rightS + ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449619bb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965dc8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449641ada0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4496468f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965df040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44964689d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449660fa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449661c790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965f3790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449646b940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965def20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44964edba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4496452980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449661da20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965df2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4496742d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44965dea40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449646b670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f449661c340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f44962448e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryNode object at 0x7f4496418be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS * ")"
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" * str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405bce950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5406027f10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405e6ab30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405d274f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405f3eda0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405d25ae0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f540618a710>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405c8ec20>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f540618a5f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405bc7a90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5406051240>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("can't multiply sequence by non-int of type 'str'") raised in repr()] BinaryTree object at 0x7f5405bc6380>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" * str(self.root)
E       TypeError: can't multiply sequence by non-int of type 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43ce9fa90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2e09a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d118790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d210c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2e3f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d210160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d317370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43cf4ed70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2e1720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43cf4dfc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2e04f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43cf4c160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d210e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2f5270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43ce939a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d218a60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43ce91ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43cf4f2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d21a800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d322830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc43d2f7820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" / leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c13f9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c584820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c3684f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c3dcd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c3f69e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c3dd3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c586b60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c41f5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c586320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c5962c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c585bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c597eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c586b90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c465c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c41f940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c467c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c41d2d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c466d70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c3c5ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c424370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5c7c6e62c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS / " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f855158b910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85519e0d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85517fea40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f855182b3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551831ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f855182a9e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85518b55d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f855185b790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551a0e710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f855185b2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551a0d180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551859fc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551b321d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551858670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551a0f2e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85518293f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551a0cc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8551829db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85519d16c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85519e3d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f85518b5c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " / str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bd6e90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bb6380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bdcac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864783cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38647725f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864a13e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864772650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864c02530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bb6710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864858a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bb6800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bd43a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864781ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38647731f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864783760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38647722f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f38648284f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864d2a440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864bd7af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864829d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3864a8c700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) / " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a0c3910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a50a710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a546380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a433af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a40e260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a431120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a51bd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a395c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a537ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a16ec80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a0c0160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a3343a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a0c08e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a5180d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a40da20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a335c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a40cf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a336170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a16df60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a3a1870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f536a0bbdf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" / rightS + ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d5cb8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da23940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d84c5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d6bf160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d962ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d6bc610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d8be890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d87f640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4db86680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d6be710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d5c8670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da31960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d67b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d6be320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da22740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d5c06a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da23280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d5c3580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da4ffa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4d67a4d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f6b4da4ea70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS / ")"
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" / str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b20a6e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b653d00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b653460>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b57b370>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b52d1e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b57ab30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b67d1e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b503070>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b4896c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b578d60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b489d20>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for /: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fb87b5789d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" / str(self.root)
E       TypeError: unsupported operand type(s) for /: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.42s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91c8b880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91c7ca60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb9210ec80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91fff820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91f7e2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91ffda20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91d34f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb921038b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91f0d000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb9210fbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91f7fd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91ffb5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb920e0640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb92103a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91f7f9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91c7e8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb922327a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91c7fe80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb9210d690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91d46230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fcb91f9e230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" // leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91521cbb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915258f370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91524494b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915249b850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152611d80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915249b5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152772740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91522769b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91527726e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915263e0b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152611c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91521c8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152612650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915263c100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152771a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152276ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91526118d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152275de0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f915244a6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9152553a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f91521c89d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS // " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea6e139d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea8029390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea726a8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea70f11e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea7103f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea6e12d40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea728d9c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea71ad3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea707c3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea715b1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea707dc60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea726ba60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea6ec25f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea727b9d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea707c130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea71aed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea6e11600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea71afe50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea715a920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea73ceb00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8ea72798a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " // str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c04d38e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c091b940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07445e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07a7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07caad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07a4670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07e6950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c082b6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c0a7ab90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07a43d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c04d0610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c0928040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c057f070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c07a6cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c091a980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c04caa70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c091b5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c04c9ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c09464a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c057e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f68c0946e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) // " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e1179fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11be09a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11a1dff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11a7cc10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11be3610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11a7caf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11c139a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11c239a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11be2920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11a7fb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11d467a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11b24d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e117978b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11bf7a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e1185b760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11bf7880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e1184a560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e1179e290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11b25c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11923c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0e11795c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" // rightS + ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56cd79a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed5712fcd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f63850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed570535b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed5703a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed57052d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56fa1e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f7f580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f637c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f7d390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed5715a710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed5712e020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56cd6410>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f7e020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56cd6920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f7e8f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56cd5570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f7e650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56f633a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed57169510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fed56dfbc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS // ")"
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" // str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce405e8f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce44b5030>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce42ccaf0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce4303340>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce439da50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce4300130>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce46061d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce411dba0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce46062f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce4300bb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce42e7d90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for //: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7efce405d780>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" // str(self.root)
E       TypeError: unsupported operand type(s) for //: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ee7b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ee714b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f2fd300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f1ef4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f166260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f422230>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ef2a080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f2c3c10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f2d3e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f127cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f2f7be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f0f3670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f1661d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f125f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f4226e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ee7bfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f1642e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ee785e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68f14eef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ee72380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fb68ef39db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" % leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc6ab9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbcaf0580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc90ba30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc98bb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc95e6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc9890c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc9cd870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbca2b730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc95cfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbca29330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc90a590>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbcb036d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc6a9cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc755810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbcc52110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc764640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbcc52b30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc7650f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc756080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbcaf0610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f6dbc6aa710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS % " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2b4fb20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2f13460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2dcd780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2e1f700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2f97790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2e1d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c30f6d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2bfa680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c30f6530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2fc2140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2f96830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2b4cb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2f96560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2fc0f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c30f6da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2bf9240>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2f94d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2bf97e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2fc1f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2fa6440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0c2c09780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " % str(self.value) + " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fb9f9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413ffe4580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe10670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe703a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fece6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe719f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe87a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fd1b730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413feccfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fd19420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe10100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fff7e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fb9ca90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fc48d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f41401464a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fc5b0a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f4140146110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fc5ac80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fc4bfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413fe6b100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7f413ffe6c50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) % " R:" + rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810de79a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd81122c580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd811058670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd8110efb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd8111166b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd8110ed0c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd8110cfa30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810f67730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd811114fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810f65420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd811058100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd81123fe50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810de4a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810e90d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd81138e560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810ea30a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd81138e1d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810ea2c80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd810e93fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd811077100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd81122ec50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" % rightS + ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0dcb790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0d05c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0f82980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e114b4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0dca170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e114b5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0dca9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e114bc70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0d04820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e1195300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0d06440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e1194520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e1006800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0f9d990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0fb7fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e116a2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0d05480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e1186ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e116b160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0d059f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryNode object at 0x7fd0e0dbd660>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS % ")"
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" % str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc631b2980>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc635fbb50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc643b8eb0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc63626800>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc631a8040>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc6375a950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc6325f4c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc634bcd00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc6325e860>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc634bfe20>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc6325d630>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError('not all arguments converted during string formatting') raised in repr()] BinaryTree object at 0x7efc634bcd90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" % str(self.root)
E       TypeError: not all arguments converted during string formatting

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e89f8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5ece6440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb25c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb6ec50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5ebba2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb6c490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e89e770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e949e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5ece7190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5ed11d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb6d0f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb0f8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb272b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e897a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eba98a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb0ccd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e949b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb0ce50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5e95a710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb5c040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4f5eb38fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ** leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fbf7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f348004f370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe90190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe97760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe9a200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe96bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff59a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff375e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe98ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff36c20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe90310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3480061810>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fbea1d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff371c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f34801b25c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff35ba0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f34801b2890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347ff346a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f34800618d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fca5510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f347fe94a30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ** " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5ab3a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5efb1f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5d20df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5dab5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5efaf20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5daa6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5f252d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5e27580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded605b100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5dab220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5ab2fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5b6cd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5d23640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5ef9f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5aa9b40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5ef8490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5aaba60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5efa020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5da9390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded5c07280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fded605a5f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ** str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d2539d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d69bd30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4d1510>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4f0dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d5c6620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4f2d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d576800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d546860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d7fae00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4f2c50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d250400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d5c7280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d30cf70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d5c4bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4d3b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d5c54b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d4d0940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d5c68c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d6c7040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d56db70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f306d7faef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ** " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c45bfb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4a026e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c45b5960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c467a9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c484c460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c467b640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c47d26b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4669c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c484e170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4a006d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c482dcc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4904130>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c45be5c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4b664d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c482ca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4b66ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c482d780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c467a080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c4a01a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c479f760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99c45b6740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ** rightS + ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a4f17970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a535eef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a51849d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a4faf490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a52562f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a4faebf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a51c8d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a522b580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a5184880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a52290c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a5388af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a535f220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a4f16380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a522a320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a538bd90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a54be740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a5388f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a535e980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a5043a00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a4f14d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f41a522a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ** ")"
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ** str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c7c5a8f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c80a3a60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c8e6d030>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c80ce8c0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c81aff70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c8202f80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c7d14730>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c8e6d090>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c80cc0a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c7f74dc0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c80cf6a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ** or pow(): 'str' and 'str'") raised in repr()] BinaryTree object at 0x7ff8c7c538e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ** str(self.root)
E       TypeError: unsupported operand type(s) for ** or pow(): 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98add1b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae162fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98adf8ea40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98adfb71f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae00e290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98adfb6e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae02ffd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae073520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98adf8ef80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae071210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae18d600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98addc6320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae02ca00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98addd7dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae18e380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae173670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae02fa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae2c2aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98addc6fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98add184f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f98ae00e920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" >> leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa249b940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa28e07c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa270c6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa273b5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa27ca2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa273ab30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa28e1630>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa276f670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa28f0970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa276dd50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa28f3520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa291c4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa25468f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa2a42800>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa25545e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa276e080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa2555120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa2782860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa2739d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa25447c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fdaa28e3400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS >> " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25103850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25568790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2539e860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa253a3820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25479d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa253a23b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25463d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251b5e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25463f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251b5750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2547a290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2539f4c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251c47f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa25559ff0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251c4370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2555acb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251c6530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2555b460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa251b60b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa250fa350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7faa2539e830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " >> str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3c1b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a4072ef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3e9e9e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ef7520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3f92200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ef6ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3f99ae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ebf670>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3f90c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ebe530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3e9c2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a409ca60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3c0e470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ebf850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a41d65f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ebdb70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a41d6440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ebd480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a409da80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3cc9a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f93a3ef4ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) >> " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699a0b8e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56999fc070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699e8d570>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699d6a2f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699d9a8c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699d6b880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699a0a770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699cff730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699ca1bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699ab7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699a08100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699ab6980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699a09420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699fb23b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699e534f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699b92050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699e503a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699b90760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699ab7280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f56999ff190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5699b93940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" >> rightS + ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f0105fa00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014a77f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f012e15a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f012f7250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014a7340>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f012f7070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014d8fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014e3b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014a5a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f012f4520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f0105f040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f013e4580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f01050970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014b4dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f010536d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014b4c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f011187c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f014b74f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f013e6410>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f016061a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9f0132db10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS >> ")"
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" >> str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af47b280>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af84af80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af857040>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af7fbb80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af707a90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af3b59f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af7f9a80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af3b6200>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af46f340>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af6a2a70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af46e0e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for >>: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f93af6a0df0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" >> str(self.root)
E       TypeError: unsupported operand type(s) for >>: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866913e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f286684e080>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866ad2f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866c934c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866912620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866c93460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866912170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866c92f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f286684c190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866e06170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f286684dc30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866e06440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866cb3460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866905900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866ba5540>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866ca75e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866b7f7f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866906770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866ae44f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f286684fc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2866ba69e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" << leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70ae97a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2def80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b115bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b167640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b21e9e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b166e60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b12ebf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b133610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70ae96e30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b165360>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70af52c50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2ed420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70af431c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2dcb80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70af50970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2de7d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70af50820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2dc040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b1647c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b116fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd70b2eee30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS << " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cd7b9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219df81300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cfec580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d3229b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cd7bfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d3222f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d032620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d04f6d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d1d03d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219ce26770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cd78490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cfede10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d0315d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d0d2a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d04fa60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d1ede40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d1fee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219cfecee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d1ee770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219ce26a70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f219d322fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " << str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa92739d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa96b8640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa96f5f90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa9517970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa95b2350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa9515000>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa9273c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa931f4f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa96bace0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa96e7e20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa9515180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa94e3550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa96f6aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa926ace0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa94fed70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa94e1180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa931ed40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa94e2740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa932dcf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa93de170>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbfa9551180>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) << " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425da69e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425d9d4b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f042602d7e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04260e5ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f042605a350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04260e7400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425e50730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426219300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426005390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f042602c940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426058520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426086290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04261fe140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425da43a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426059b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0426084b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04261ff970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f042634e710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f04260e55d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425da7790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f0425e66290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" << rightS + ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb12ef970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb12e4370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1771990>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb16778e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1596200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1896dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb139a710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb165fdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1747e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb13a8b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1761cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb17372b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1571c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb13a9a20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb1570ee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb13ab250>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb17478b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb13aa830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb15c2f20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb12e55d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fbdb15bf220>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS << ")"
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" << str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d3568f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d79ff10>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236e559390>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d4a8b50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d7aeef0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d4a9510>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d8fe200>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d413010>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d4034f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d5dc2b0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d402650>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for <<: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f236d5de9e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" << str(self.root)
E       TypeError: unsupported operand type(s) for <<: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0b5fbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0fa0910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0dcd840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0dfccd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0e69ab0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0dfee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd1106a40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0c09750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd1106320>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0eb6ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0e6b490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0dcf2e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0de71f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd1106a10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0e691b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0fa0f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0e681c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0fa3100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0eb44c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0dfc820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f2bd0b5cee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" | leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b411b3c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b410e98d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b415515d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4153f190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b411b2bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4153f2b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b411b25c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4153d7b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b410e96c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b416b6ad0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b410ea950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b416b6fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4155ee90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4148ff40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4140e6e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b415890f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4140e140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b410f9e70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4148ded0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4140c880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f5b4158a860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS | " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621743850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621b88730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f36219a32b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621a23190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f36219f2620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621a22bc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621ceab00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621b8a890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621ce99f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f36219ca560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621800f70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621ba3ac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621b9ad70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f362173b700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621740ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621aa4b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621742680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f3621aa7310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f362173af80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f36219f60b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f36217f1960>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " | str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7676339a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767a78850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678ac9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7679037f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7679ae6b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767903100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678dbfa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678cb730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7679afca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678c8760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767bdb160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678cb370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7679ac910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678c9780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7679ae110>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678c9c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767633430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678c9420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767a784c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd7678d7040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fd767ab7dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) | " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc904f8f9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9053d4850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9052009a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90522f730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9052466b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90522d1e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9053d59c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc905263700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9053e74f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc905261cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc905245690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc905411c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90503b640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9052e4490>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90526ef20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9052e4d30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90526cac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc90522e4a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc905260ca0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9055363b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc9054004f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" | rightS + ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960a97e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f49609d1d50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960c5c760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e174c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960a975b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e17cd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960a96980>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e17820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f49609d2650>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960f8a4a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960d58f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960f8a680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960c5dde0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960c80370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e63730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e4b7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e61270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960c80880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e37dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4960e62050>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f49609e0520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS | ")"
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" | str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc212eea740>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213333100>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213333c70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc21318b0a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc21324b790>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213188b80>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213491990>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc212f970a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc2134922f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213343b50>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213189de0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for |: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7fc213340130>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" | str(self.root)
E       TypeError: unsupported operand type(s) for |: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d8f17a90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d936f1c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d91b2cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d921aef0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d9256500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d921a0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d920a440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d91f37c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d94d2830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d9219600>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d8f14160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d9255cc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d8f09c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d9219c30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d94d2740>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d921b8b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d8f14700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d92196f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d9380640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d91f2d10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fc8d93a8190>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" & leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aa0f910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ae55690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ac95150>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30acdfac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ad82290>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30acdca30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aa0e620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aaba920>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ae56cb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ae831f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30acdd3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ac7fdc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ac96ce0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aa02f80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ad55750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ac7e1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aaba710>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ac7cee0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30aac8fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ad783d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fb30ace2b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS & " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942137c70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942071870>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99425131f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424b7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942135bd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424b5900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942136530>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424b65c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942071330>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942501750>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942070be0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942502770>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424f37f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942336da0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942325c90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f9942080610>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f994233f6a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f994262a7d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424b63b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99421355a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f99424d5a50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " & str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdb4bbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdf8c910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cddbc5e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdde4dc0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdf8edd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdde4940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdfbd390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdfcc310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdfa3fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdde62f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdf8ead0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cddf0df0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cde563e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdfccbe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdf8f5b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39ce0f2fe0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdf8f790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdde7310>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdfcc3a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdb49ed0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f39cdbf6680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) & " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c773af9a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c777f60e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c7760d6f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c7747b730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774fe3b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774791b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774d8580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774ab580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c7760e2c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774a93c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c77810580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c777f4d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c773ac070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774a9db0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c77811690>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c777f6380>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c77810400>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c777f4d60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774a8b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c77956350>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f8c774ce1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" & rightS + ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e291b910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2d726e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2dae0e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2cb7940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2c7a260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2cb4e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e29c8fa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2bbf820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2c7be50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2bf7280>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2dae860>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2bbdc90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2c3bc40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2bf4c40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2c3aaa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2dae950>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2c39900>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2daf3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2d70eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2ed5c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f67e2913e50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS & ")"
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" & str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6af66710>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b3afd00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6c179000>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b3dee00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b4bbf70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b50eb90>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b012d70>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b50eec0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b295fc0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b0b9810>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b297df0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for &: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f4c6b0bba60>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" & str(self.root)
E       TypeError: unsupported operand type(s) for &: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5c87af0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60c8880>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5ef8550>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5f18fd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60cb790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5f19c60>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60fbb50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a6109210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60cb820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5f1a500>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a622e5c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5fc8d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5c7ba90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5ffb7c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a610a5c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60debf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a6108520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5fcb3d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a60dee00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5f9b640>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fa2a5efbfd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" ^ leftS + " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179d7850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179cc580>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17c5d270>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17c886d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17cfa890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17c89a80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179d75b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17d2f730>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17ca9840>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17a86d40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179d4100>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17a85d20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179d5420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17f7e470>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17e1c430>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17b435b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17e1ee90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17b406a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17a87bb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a179cedd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f4a17b40eb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS ^ " " + str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.49s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a723b20>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aaf7460>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a9ad780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aa9f700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006ab7b790>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aa9d3c0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006acded10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a7d2680>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006acde9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aba6140>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006ab7a830>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a720b80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006ab7a560>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aba4f10>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006acdeda0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a7d1e40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006ab78d90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a7d17e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006aba5f00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006ab8a440>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7f006a7e3e80>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " ^ str(self.value) + " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc006239a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a6b820>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00892dd0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc008f43a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a6a020>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc008f5420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a9cdf0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00937700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a9dae0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00935210>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a9d6f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00bca200>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00a9d2a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc006181f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc008b4070>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc0061b970>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc008b5300>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00619780>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc008f5420>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc00891b70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7efc006e1720>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) ^ " R:" + rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.50s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd831ba90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd8762f50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd858c520>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd85fb0d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd85c69e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd85f9120>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd864a1a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd86375e0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd831ae30>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd85f8f40>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd83d6e90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd8771480>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd83c6ec0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd8762aa0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd83d44f0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd8760910>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd83d46d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd8763940>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd85fbac0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd858ea70>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7ffbd87733d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" ^ rightS + ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -65,7 +65,7 @@
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)
-        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
+        return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:15: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53423850>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53868760>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca536833a0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca536f7160>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53762620>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca536f6c50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca539cae90>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca5386a890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca539ca890>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:49: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca536a9c00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca534e3040>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
>       var_8 = var_3.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:151: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53882b00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53878370>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca5341b700>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53420d00>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53714b50>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:163: in __repr__
    return "binary:" + str(self.root)
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca534206d0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca53716fb0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca5341a9b0>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
>       var_6 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:181: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:65: in __repr__
    leftS = str(self.left)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca536e2260>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_node_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:218: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:67: in __repr__
    rightS = str(self.right)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryNode object at 0x7fca534d1390>

    def __repr__(self):
        """Useful debugging function to produce linear tree representation."""
        leftS = ''
        rightS = ''
        if self.left:
            leftS = str(self.left)
        if self.right:
            rightS = str(self.right)
>       return "(L:" + leftS + " " + str(self.value) + " R:" + rightS ^ ")"
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:68: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.52s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -160,7 +160,7 @@
     def __repr__(self):
         if self.root is None:
             return "binary:()"
-        return "binary:" + str(self.root)
+        return "binary:" ^ str(self.root)
 
 """
 Change Log:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .........F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
.............F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:76: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c243ee950>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c24847ca0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
>       var_8 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c25605300>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c248730d0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
>       var_6 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:291: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c243e05e0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:356: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c249aa2f0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
>       var_11 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:396: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c2449eb30>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c24870640>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:384: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c2449df00>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:435: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c246fbf40>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:458: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c2449d5a0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
>       var_4 = binary_tree_0.__repr__()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:484: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[TypeError("unsupported operand type(s) for ^: 'str' and 'str'") raised in repr()] BinaryTree object at 0x7f6c249aabf0>

    def __repr__(self):
        if self.root is None:
            return "binary:()"
>       return "binary:" ^ str(self.root)
E       TypeError: unsupported operand type(s) for ^: 'str' and 'str'

binarySearchTree1.py:163: TypeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
======================== 12 failed, 74 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value + target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value + target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value + target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value * target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value * target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value * target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value / target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value / target)
E       ZeroDivisionError: division by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value / target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value / target) < distance:
E           ZeroDivisionError: division by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value / target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value / target)
E               ZeroDivisionError: division by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 3 failed, 83 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value // target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value // target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value // target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value // target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value // target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value // target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 3 failed, 83 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value % target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value % target)
E       ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value % target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FF.................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ....F.......... [ 53%]
...F......FF....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
>       var_3 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
>       var_4 = binary_tree_0.closest(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:110: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:203: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
>       var_8 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:321: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:157: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.closest(bool_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:178: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value % target) < distance:
E           ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 11 failed, 75 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value % target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F....FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
>       var_10 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:348: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) 427 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
>       var_12 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:470: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:)), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
>       var_14 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:500: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L:(L: True R:) 1625 R:)) 1656 R:), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
            if abs(node.value - target) < distance:
>               distance = abs(node.value % target)
E               ZeroDivisionError: integer division or modulo by zero

binarySearchTree1.py:143: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 3 failed, 83 passed in 0.28s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ** target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value ** target)
E       ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:140: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.25s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ** target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value ** target) < distance:
E           ZeroDivisionError: 0.0 cannot be raised to a negative power

binarySearchTree1.py:142: ZeroDivisionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.26s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ** target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value >> target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value >> target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.29s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value >> target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value >> target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.26s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value >> target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value << target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value << target)
E       ValueError: negative shift count

binarySearchTree1.py:140: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.31s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value << target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
>       var_7 = binary_tree_0.closest(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:235: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:), target = -201

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is None:
            return None
    
        best = node = self.root
        distance = abs(self.root.value - target)
        while node:
>           if abs(node.value << target) < distance:
E           ValueError: negative shift count

binarySearchTree1.py:142: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
========================= 1 failed, 85 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value << target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value | target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value | target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value | target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.26s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value & target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value & target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value & target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.26s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -137,7 +137,7 @@
             return None
         
         best = node = self.root
-        distance = abs(self.root.value - target)
+        distance = abs(self.root.value ^ target)
         while node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.27s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value ^ target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -140,7 +140,7 @@
         distance = abs(self.root.value - target)
         while node:
             if abs(node.value - target) < distance:
-                distance = abs(node.value - target)
+                distance = abs(node.value ^ target)
                 best = node
             if target < node.value:
                 node = node.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while n.left is None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F...... [ 12%]
.....F....F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
F.................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f1b090bbe50>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left is None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 6 failed, 80 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while n.right is None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F..F [ 53%]
FFFF.FF.FFFFF.FFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F.... [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7ff5267dc460>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right is None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 37 failed, 49 passed in 0.68s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val == self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
....F.........                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 10 failed, 76 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target == node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...F.FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..FF...........F..                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
.....FF...F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 19 failed, 67 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) == distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.26s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target == node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
========================= 5 failed, 81 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val != self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
========================= 1 failed, 85 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target != node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
................F..F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...............FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 5 failed, 81 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) != distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target != node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
...........FF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
.............F..F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
========================= 6 failed, 80 passed in 0.33s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val <= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
========================= 9 failed, 77 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target <= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 65 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) <= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target <= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val > self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
....F.........                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
========================= 2 failed, 84 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target > node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
................F..F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..F............FF.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FF.......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
========================= 7 failed, 79 passed in 0.31s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) > distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target > node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........FFF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..........F.....F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 76 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val >= self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
....F.........                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 10 failed, 76 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target >= node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...F.FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..FF...........FF.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
.....FF...F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 66 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) >= distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target >= node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........FFF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..........F.....F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 76 passed in 0.33s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
....F.........                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 10 failed, 76 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...F.FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..FF...........F..                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
.....FF...F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 19 failed, 67 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
========================= 5 failed, 81 passed in 0.31s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if val is not self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
========================= 1 failed, 85 passed in 0.25s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if target is not node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
................F..F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...............FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = var_5.__repr__()
        assert var_6 == 'True'
        var_7 = binary_tree_0.__contains__(var_3)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:336: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 5 failed, 81 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if abs(node.value - target) is not distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.26s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if target is not node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
...........FF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
.............F..F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
========================= 6 failed, 80 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val == self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F.FF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 6 failed, 80 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val != self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F........F. [ 12%]
......FFFF.FFF..FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 29 failed, 57 passed in 0.55s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val < self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F........F. [ 12%]
......F....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
.........F........                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.......F......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: F...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L: False R:(L: True R:))

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... R:) True R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                       ^^^         ----------
E         + binary:(L:(L: False R:) True R:)
E         ?                       ^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L: -4493 R:(L: False R:(L: True R:)))

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 13 failed, 73 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val > self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F........F. [ 12%]
......FFFF.FFF..FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 29 failed, 57 passed in 0.51s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val >= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.......FFF.FF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
...........FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F.FF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 6 failed, 80 passed in 0.31s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if val is not self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F........F. [ 12%]
......FFFF.FFF..FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:) False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 29 failed, 57 passed in 0.53s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.......FFF.FF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
...........FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val == self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F......F                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.............F                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 11 failed, 75 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFF.                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FF...                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 17 failed, 69 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target == node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.....F..............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 2 failed, 84 passed in 0.29s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val != self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target != node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.......FFF.FF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
...........FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val < self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.................F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..............F..F                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.............F                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...R:)) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?               ^^^^        ^^^^
E         + binary:(L:(L: True R:(L: 3380 R:)) 3380 R:)
E         ?               ^^^        ^^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
========================= 4 failed, 82 passed in 0.29s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F.............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:170: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
========================= 1 failed, 85 passed in 0.28s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target < node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.....F..............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 2 failed, 84 passed in 0.28s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.......FFF.FF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
...........FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val <= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F......F                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.............F                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 11 failed, 75 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFF.                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FF...                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 17 failed, 69 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target <= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.....F..............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 2 failed, 84 passed in 0.29s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.30s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val >= self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
========================= 9 failed, 77 passed in 0.34s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 65 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target >= node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.27s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.......FFF.FF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
...........FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:144: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.48s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F......F                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.............F                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
        var_0 = binary_node_0.remove(int_0)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:226: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
======================== 11 failed, 75 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFF.                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FF...                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 17 failed, 69 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.....F..............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert 451 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 2 failed, 84 passed in 0.27s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -17,7 +17,7 @@
         """
         if val <= self.value:
             self.left = self.addToSubTree(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.addToSubTree(self.right, val)
 
     def addToSubTree(self, parent, val):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -34,7 +34,7 @@
         """
         if val < self.value:
             self.left = self.removeFromParent(self.left, val)
-        elif val > self.value:
+        elif val is not self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
             if self.left is None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -121,7 +121,7 @@
         while node:
             if target < node.value :
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return True

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -144,7 +144,7 @@
                 best = node
             if target < node.value:
                 node = node.left
-            elif target > node.value:
+            elif target is not node.value:
                 node = node.right
             else:
                 return target

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.25s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if parent is not None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F......F. [ 12%]
.....FFFFF.FFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........F..F [ 53%]
.F...FFFFFFFFFFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if parent is not None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 41 failed, 45 passed in 0.73s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if self.left is not None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
F.....F.F........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
.....F....FF.FF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is not None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 17 failed, 69 passed in 0.45s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if self.root is not None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F...FF. [ 12%]
.FFF.FF.FFFFFFFFFFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F......F.FF [ 53%]
FFFF.FFFFFFFFFFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF.... [ 83%]
.....FFF..F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if self.root is not None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 51 failed, 35 passed in 0.81s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF..... [ 12%]
.....F....F..FF.....                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F....F... [ 53%]
F......F....F.....                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F..... [ 83%]
...F......F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f6234d07d60>

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 15 failed, 71 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if self.root is not None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F.... [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F...F..F [ 53%]
FFFF.FF.FFFFF.FFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F.... [ 83%]
....FFFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fb9e1ee39a0>

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is not None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 40 failed, 46 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if self.root is not None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .......F... [ 12%]
.FF..F..FFFFF..FFFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F.F..F [ 53%]
...F..FFF.FFFFF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..F..FFF..F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if self.root is not None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 35 failed, 51 passed in 0.65s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if self.root is not None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........FF. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........FF... [ 53%]
..F..........F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F....... [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 16 failed, 70 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -15,7 +15,7 @@
         """
         Add a new node to the tree with value. Respond based on Set semantics
         """
-        if val <= self.value:
+        if not val <= self.value:
             self.left = self.addToSubTree(self.left, val)
         elif val > self.value:
             self.right = self.addToSubTree(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F........F. [ 12%]
......FFFF.FFF..FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
.F...F...F.F.FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(int_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:10: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:183: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:12: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:134: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:290: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:(L...R:) -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:(L: False R:) -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:56: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:72: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
>       assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:217: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 29 failed, 57 passed in 0.54s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -22,7 +22,7 @@
 
     def addToSubTree(self, parent, val):
         """Add val to parent subtree (if exists) and return root of that subtree."""
-        if parent is None:
+        if not parent is None:
             return BinaryNode(val)
 
         parent.add(val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py F.F......F. [ 12%]
.....FFFFF.FFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF........F..F [ 53%]
.F...FFFFFFFFFFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..FF. [ 83%]
.......F...FF.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_0 __________________________________

    def test_case_0():
        int_0 = 442
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:9: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 442 R:), parent = None, val = 442

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:25: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
        assert var_9 == 'binary:(L: False R:)'
>       var_10 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = 451

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
>       var_6 = binary_tree_0.add(var_5)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:182: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:194: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:212: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:247: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:269: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:287: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:330: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:346: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 3380 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
>       var_4 = binary_tree_0.add(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:385: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -4493 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:11: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        object_0 = module_1.object()
        var_3 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:43: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:107: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:133: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:173: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:224: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
>       var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:239: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: None R:), parent = None, val = (L: None R:)

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:262: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(var_5).__module__}.{type(var_5).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:281: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_node_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:289: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
>       assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:317: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:337: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
>       var_3 = binary_node_0.addToSubTree(var_2, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:360: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:388: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:412: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
>       assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
E       AssertionError: assert 'binarySearchTree1.BinaryNode' == 'binarySearchTree1.BinaryTree'
E         - binarySearchTree1.BinaryTree
E         ?                         ^^ -
E         + binarySearchTree1.BinaryNode
E         ?                         ^^^

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:439: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:457: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -2656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:483: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 1656 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.add(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:29: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:93: in add
    self.root.add(value)
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [] R:), parent = None, val = []

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
>       var_1 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:19: in add
    self.left = self.addToSubTree(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
>       assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:167: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        bool_0 = False
        int_0 = -995
        binary_node_0 = module_0.BinaryNode(int_0)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: -995 R:), parent = None, val = False

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
>       var_0 = binary_node_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:21: in add
    self.right = self.addToSubTree(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def addToSubTree(self, parent, val):
        """Add val to parent subtree (if exists) and return root of that subtree."""
        if not parent is None:
            return BinaryNode(val)
    
>       parent.add(val)
E       AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:28: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 41 failed, 45 passed in 0.76s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -32,7 +32,7 @@
         """
          Remove val of self from BinaryTree. 
         """
-        if val < self.value:
+        if not val < self.value:
             self.left = self.removeFromParent(self.left, val)
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
......F..........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
..........F.......                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
....F.........                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
        var_4 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:61: AssertionError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(bool_0)
>       assert binary_node_0.left is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = (L:(L: True R:) True R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:74: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
>       assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
E       AssertionError: assert 'builtins.NoneType' == 'binarySearchTree1.BinaryNode'
E         - binarySearchTree1.BinaryNode
E         + builtins.NoneType

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:115: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
======================== 10 failed, 76 passed in 0.35s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -37,7 +37,7 @@
         elif val > self.value:
             self.right = self.removeFromParent(self.right, val)
         else:
-            if self.left is None:
+            if not self.left is None:
                 return self.right
 
             child = self.left

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
F.....F.F........F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F..........F.FF [ 53%]
.....F....FF.FF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_11 _________________________________

    def test_case_11():
        bool_0 = False
        list_0 = [bool_0, bool_0]
        binary_node_0 = module_0.BinaryNode(list_0)
>       var_0 = binary_node_0.remove(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: [False, False] R:), val = [False, False]

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:198: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L:(L: True R:) True R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:14: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
>       var_2 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:124: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
>       assert binary_node_0.left is None
E       assert (L: False R:) is None
E        +  where (L: False R:) = (L:(L: False R:) False R:).left

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:137: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
        assert var_5 == 427
>       var_6 = binary_tree_0.remove(var_5)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 427 R:), val = 427

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:314: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
>       var_7 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:342: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
>       var_5 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:391: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 427 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
>       var_3 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:416: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:(L: 1625 R:)), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
>       var_8 = binary_tree_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:465: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: 1625 R:)), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:54: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if not self.left is None:
                return self.right
    
            child = self.left
>           while child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 17 failed, 69 passed in 0.46s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -41,7 +41,7 @@
                 return self.right
 
             child = self.left
-            while child.right:
+            while not child.right:
                 child = child.right
             
             childKey = child.value;

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F......F. [ 12%]
......F.....FFF..F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py F.............F [ 53%]
................F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....FF. [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.remove(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:26: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.remove(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:78: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
>       var_7 = binary_tree_0.remove(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:172: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
>       var_9 = binary_tree_0.remove(var_6)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:276: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
        var_7 = binary_tree_0.getMin()
        assert var_7 is False
>       var_8 = binary_tree_0.remove(var_4)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:296: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_2.__repr__()
        binary_node_0 = module_0.BinaryNode(var_5)
        var_6 = binary_tree_0.add(var_0)
        var_7 = binary_tree_0.getMin()
>       var_8 = binary_tree_0.remove(var_7)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:313: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L:(L: False R:) False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:)) False R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: True R:(L: 3380 R:)) False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:13: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
>       var_3 = binary_node_0.remove(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) False R:), val = False

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
>       var_11 = var_9.remove(var_7)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:469: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
binarySearchTree1.py:57: in removeFromParent
    return parent.remove(val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: False R:) 1625 R:), val = 1625

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
        assert var_2 == '(L:(L: True R:) True R:)'
        var_3 = binary_node_0.inorder()
>       var_4 = binary_node_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:60: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_node_0.remove(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L:(L: True R:) True R:), val = True

    def remove(self, val):
        """
         Remove val of self from BinaryTree.
        """
        if val < self.value:
            self.left = self.removeFromParent(self.left, val)
        elif val > self.value:
            self.right = self.removeFromParent(self.right, val)
        else:
            if self.left is None:
                return self.right
    
            child = self.left
>           while not child.right:
E           AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:44: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_6
======================== 12 failed, 74 passed in 0.41s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -53,7 +53,7 @@
     def removeFromParent(self, parent, val):
         """Helper method for remove. Ensures proper behavior when removing node that 
         has children."""
-        if parent:
+        if not parent:
             return parent.remove(val)
         return None
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..F..............F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..............F [ 53%]
......F.......F.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
....F........F                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
        assert var_4 is False
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.remove(var_3)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:113: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:), parent = None, val = True

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
        assert var_8 == '(L: False R:(L: True R:))'
>       object_0 = binary_node_0.removeFromParent(var_5, var_5)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:153: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: False R:(L: True R:)), parent = None, val = None

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
>       var_5 = binary_tree_0.remove(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:98: in remove
    self.root = self.root.remove(val)
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_node_0.remove(bool_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:114: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:36: in remove
    self.left = self.removeFromParent(self.left, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: True R:), parent = None, val = False

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        int_0 = 2683
        float_0 = 112.342
        binary_node_0 = module_0.BinaryNode(float_0)
>       var_0 = binary_node_0.remove(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 
binarySearchTree1.py:38: in remove
    self.right = self.removeFromParent(self.right, val)
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = (L: 112.342 R:), parent = None, val = 2683

    def removeFromParent(self, parent, val):
        """Helper method for remove. Ensures proper behavior when removing node that
        has children."""
        if not parent:
>           return parent.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:57: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_21
========================= 9 failed, 77 passed in 0.38s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -61,7 +61,7 @@
         """Useful debugging function to produce linear tree representation."""
         leftS = ''
         rightS = ''
-        if self.left:
+        if not self.left:
             leftS = str(self.left)
         if self.right:
             rightS = str(self.right)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L:No...(L: True R:))' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         ?                       ---      ---------
E         + binary:(L:None False R:(L: True R:))
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         ?           ---          ----------
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L: 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L: 3380 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L:No...L: True R:)))' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         ?                                   ---     ---------
E         + binary:(L:None -4493 R:(L:None False R:(L: True R:)))
E         ?           ++++            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L:None None R:)' == '(L: None R:)'
E         - (L: None R:)
E         ?    -
E         + (L:None None R:)
E         ?         +++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L:None True R:)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L:None True R:)
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L: False R:)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:None False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:None False R:)
E         ?           ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L:No...ne False R:))' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:(L:None -2656 R:(L:None False R:))
E         ?           ++++            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L: 1656 R:)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L: 1656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L:None False R:)' == '(L: False R:)'
E         - (L: False R:)
E         + (L:None False R:)
E         ?    ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L: True R:)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L: True R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L:None Fals...one True R:))' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L:None False R:(L:None True R:))
E         ?    ++++            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -63,7 +63,7 @@
         rightS = ''
         if self.left:
             leftS = str(self.left)
-        if self.right:
+        if not self.right:
             rightS = str(self.right)
         return "(L:" + leftS + " " + str(self.value) + " R:" + rightS + ")"
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .F.F.....F. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...F.......F..F [ 53%]
.........F...F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .....F.. [ 83%]
.F.....F....F.                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_1 __________________________________

    def test_case_1():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:16: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:32: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:(L: False R:)' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:(L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:(L:(L...False R:None)' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:(L:(L: False R:None) False R:None)
E         ?                       ++++          ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L... 3380 R:None)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         ?                     -----------   -
E         + binary:(L:(L: False R:) 3380 R:None)
E         ?                                ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:(L: -4493 R:)' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:(L: -4493 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: None R:)'
E       AssertionError: assert '(L: None R:None)' == '(L: None R:)'
E         - (L: None R:)
E         + (L: None R:None)
E         ?            ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:50: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:(L: True R:None)' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:(L: True R:None)
E         ?                   ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = var_3.addToSubTree(binary_tree_0, bool_0)
        var_8 = var_3.__repr__()
>       assert var_8 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:152: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
>       assert var_4 == '(L:(L: False R:) False R:)'
E       AssertionError: assert '(L:(L: False...False R:None)' == '(L:(L: False R:) False R:)'
E         - (L:(L: False R:) False R:)
E         + (L:(L: False R:None) False R:None)
E         ?                ++++          ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:297: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L: False R:None)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L: False R:None)
E         ?                    ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:(L: -2656 R:)' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         ?                  ------------   -
E         + binary:(L: -2656 R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:(L:(L... 1656 R:None)' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:(L:(L: False R:None) 1656 R:None)
E         ?                       ++++         ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.removeFromParent(binary_node_0, bool_0)
        var_1 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_node_0.__repr__()
>       assert var_2 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        bytes_0 = b'<N\n'
        bool_0 = False
        none_type_0 = None
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_0 = binary_node_0.__repr__()
>       assert var_0 == '(L: False R:)'
E       AssertionError: assert '(L: False R:None)' == '(L: False R:)'
E         - (L: False R:)
E         + (L: False R:None)
E         ?             ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:94: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
        assert var_5 is True
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_node_0.__repr__()
>       assert var_6 == '(L:(L: True R:) True R:)'
E       AssertionError: assert '(L:(L: True ... True R:None)' == '(L:(L: True R:) True R:)'
E         - (L:(L: True R:) True R:)
E         + (L:(L: True R:None) True R:None)
E         ?               ++++         ++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:182: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        bool_0 = True
        bool_1 = False
        binary_node_0 = module_0.BinaryNode(bool_1)
        var_0 = binary_node_0.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_node_0.__repr__()
>       assert var_1 == '(L: False R:(L: True R:))'
E       AssertionError: assert '(L: False R:)' == '(L: False R:(L: True R:))'
E         - (L: False R:(L: True R:))
E         + (L: False R:)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:219: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_20
======================== 21 failed, 65 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -69,7 +69,7 @@
 
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
-        if self.left:
+        if not self.left:
             for v in self.left.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -75,7 +75,7 @@
 
         yield self.value
 
-        if self.right:
+        if not self.right:
             for v in self.right.inorder():
                 yield v
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -87,7 +87,7 @@
    
     def add(self, value):
         """Insert value into proper location in Binary Tree."""
-        if self.root is None:
+        if not self.root is None:
             self.root = BinaryNode(value)
         else:
             self.root.add(value)

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F.F...FF. [ 12%]
.FFF.FF.FFFFFFFFFFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .FF.F......F.FF [ 53%]
FFFF.FFFFFFFFFFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py .FFF.... [ 83%]
.....FFF..F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:23: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
        assert var_1 == 'binary:()'
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:65: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:73: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:93: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:104: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:119: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:140: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:190: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:208: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
>       var_3 = binary_tree_0.add(var_2)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:225: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:243: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:265: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:285: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:302: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:318: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:344: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 3380

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
>       var_2 = binary_tree_0.add(var_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:383: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -4493

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:39: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:55: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:100: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:146: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:158: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:171: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:183: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 'binary:()'

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:197: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:220: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:244: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:257: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:275: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:293: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_2 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:309: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
>       var_3 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:333: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
>       var_4 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:365: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:382: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:408: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_2 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:433: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
>       var_1 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:452: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = -2656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
>       var_2 = binary_tree_0.add(int_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:481: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = 1656

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(list_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:27: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = []

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
>       var_1 = binary_tree_0.add(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:42: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = binary:()

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:128: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:147: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
>       var_1 = binary_tree_0.add(bool_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:170: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = True

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.add(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), value = False

    def add(self, value):
        """Insert value into proper location in Binary Tree."""
        if not self.root is None:
            self.root = BinaryNode(value)
        else:
>           self.root.add(value)
E           AttributeError: 'NoneType' object has no attribute 'add'

binarySearchTree1.py:93: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 51 failed, 35 passed in 0.79s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -94,7 +94,7 @@
 
     def remove(self, val):
         """Remove value from tree."""
-        if self.root:
+        if not self.root:
             self.root = self.root.remove(val)
 
     def getMin(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F..F...F. [ 12%]
.....FF...F..F...F..                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .....F.....F.F. [ 53%]
..........F.F.....                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F.... [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:20: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:45: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:70: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:137: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:(L:(L...R:) False R:)' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:(L:(L: False R:) False R:)
E         ?           +++          ++++++++++

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:223: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:282: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = binary:()

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:(L:(L...:))) 3380 R:)' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:(L:(L: False R:(L: True R:(L: 3380 R:))) 3380 R:)
E         ?                                +++++++++++    +

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        str_0 = 'j_XwI\'J"{^zfX[y'
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.remove(str_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:63: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = 'j_XwI\'J"{^zfX[y'

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:105: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = var_0.__repr__()
        var_2 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:125: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
>       assert binary_tree_0.root is None
E       assert (L: True R:) is None
E        +  where (L: True R:) = binary:(L: True R:).root

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:315: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_1 = binary_tree_0.remove(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:357: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = False

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
>       var_0 = binary_tree_0.remove(float_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:41: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), val = -1660.53234

    def remove(self, val):
        """Remove value from tree."""
        if not self.root:
>           self.root = self.root.remove(val)
E           AttributeError: 'NoneType' object has no attribute 'remove'

binarySearchTree1.py:98: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
======================== 14 failed, 72 passed in 0.39s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -99,7 +99,7 @@
 
     def getMin(self):
         """Returns minimum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.left != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....FF..... [ 12%]
.....F....F..FF.....                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ......F....F... [ 53%]
F......F....F.....                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F.F..... [ 83%]
...F......F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f0ec5977dc0>

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_5 __________________________________

    def test_case_5():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:47: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
        assert var_6 == 'binary:(L:(L: False R:) False R:)'
        binary_node_0 = module_0.BinaryNode(var_5)
>       var_7 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:294: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:305: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:68: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(var_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(var_1)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        object_0 = module_1.object()
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_5 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:264: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_node_1.addToSubTree(binary_tree_0, bool_0)
        var_8 = module_0.BinaryNode(binary_tree_0)
>       var_9 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:373: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: True R:) True R:) True R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
        assert var_1 == 'binary:()'
        with pytest.raises(ValueError):
>           binary_tree_1.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:17: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:31: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L:(L: [] R:) [] R:) [] R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:107: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:103: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_5
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 15 failed, 71 passed in 0.40s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -102,7 +102,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.left != None:
+        while not n.left != None:
             n = n.left
         return n.value
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ....F...... [ 12%]
.....F....F.........                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F... [ 53%]
F.................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:38: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7fa93f657c70>

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:143: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L: True R:)'
>       var_6 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:112: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is True
>       var_2 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:162: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
>       var_3 = binary_tree_0.getMin()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:200: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMin(self):
        """Returns minimum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.left != None:
E       AttributeError: 'NoneType' object has no attribute 'left'

binarySearchTree1.py:105: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
========================= 6 failed, 80 passed in 0.33s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -108,7 +108,7 @@
 
     def getMax(self):
         """Returns maximum value."""
-        if self.root is None:
+        if not self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
         while n.right != None:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ......F.... [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py .......F...F..F [ 53%]
FFFF.FF.FFFFF.FFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F.... [ 83%]
....FFFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_6 __________________________________

    def test_case_6():
        binary_tree_0 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:52: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:195: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:213: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:248: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:331: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:370: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:389: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -4493 R:(L: False R:(L: True R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = module_0.BinaryTree()
        var_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:75: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:174: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:227: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:298: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: True R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:414: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:(L: 1625 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:442: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:(L: 427 R:))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
>       var_7 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:463: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: -2656 R:(L: False R:(L: 1625 R:)))

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f658a2823e0>

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = False
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_node_0.remove(bool_1)
        assert f'{type(var_0).__module__}.{type(var_0).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_0.value is True
        assert var_0.left is None
        assert var_0.right is None
        var_1 = binary_node_0.inorder()
        binary_tree_1 = module_0.BinaryTree()
        with pytest.raises(ValueError):
>           binary_tree_1.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:122: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if not self.root is None:
>           raise ValueError("Binary Tree is empty")
E           ValueError: Binary Tree is empty

binarySearchTree1.py:112: ValueError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_6
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 40 failed, 46 passed in 0.72s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -111,7 +111,7 @@
         if self.root is None:
             raise ValueError("Binary Tree is empty")
         n = self.root
-        while n.right != None:
+        while not n.right != None:
             n = n.right
         return n.value
     

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ...........F..F [ 53%]
FFFF.FF.FFFFF.FFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ...F.... [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:95: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:106: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:121: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:145: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:166: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:196: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:214: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
>       var_5 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:229: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:249: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:288: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:307: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:) False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:332: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:350: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: True R:)) 3380 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:371: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
>       assert var_6 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:390: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.closest(var_0)
        var_3 = binary_node_0.remove(var_0)
        assert binary_node_0.left is None
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is False
        assert var_3.left is None
        assert var_3.right is None
        bool_0 = True
        var_4 = var_3.add(bool_0)
        assert f'{type(binary_node_0.right).__module__}.{type(binary_node_0.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_3.right).__module__}.{type(var_3.right).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:148: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.getMax()
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:175: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_3 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:185: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: binary:() R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_1 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:199: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: False R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.getMax()
>       assert var_5 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:228: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        var_2 = binary_node_0.addToSubTree(none_type_0, binary_node_0)
        assert f'{type(var_2).__module__}.{type(var_2).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_2.value).__module__}.{type(var_2.value).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_2.left is None
        assert var_2.right is None
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:246: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:278: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(binary_node_0)
        bool_0 = True
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_node_0.__repr__()
        assert var_4 == '(L:(L: False R:) False R:)'
        var_5 = binary_tree_0.getMax()
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:299: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:312: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:341: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
        var_2 = binary_tree_0.closest(var_0)
        bool_0 = True
        var_3 = binary_node_0.addToSubTree(var_2, bool_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert var_3.value is True
        assert var_3.left is None
        assert var_3.right is None
        var_4 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_node_1 = module_0.BinaryNode(var_2)
        var_5 = binary_tree_0.add(bool_0)
>       var_6 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:369: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
>       assert var_2 == 1625
E       assert True == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:415: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
>       assert var_6 == 427
E       assert False == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:443: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
>       assert var_7 == 1625
E       assert -2656 == 1625

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:464: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
>       var_8 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:492: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: False R:(L: 1625 R:)) 1656 R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_3 __________________________________

    def test_case_3():
        binary_tree_0 = module_0.BinaryTree()
        float_0 = -1660.53234
        str_0 = 'BhpUfU<<C<'
        var_0 = binary_tree_0.remove(float_0)
        var_1 = binary_tree_0.add(binary_tree_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:44: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = <[RecursionError('maximum recursion depth exceeded while calling a Python object') raised in repr()] BinaryTree object at 0x7f7f76df2e30>

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:136: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
>       var_2 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:155: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L: True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
>       var_4 = binary_tree_0.getMax()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:176: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(L:(L: True R:) True R:)

    def getMax(self):
        """Returns maximum value."""
        if self.root is None:
            raise ValueError("Binary Tree is empty")
        n = self.root
>       while not n.right != None:
E       AttributeError: 'NoneType' object has no attribute 'right'

binarySearchTree1.py:114: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_3
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 37 failed, 49 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -118,7 +118,7 @@
     def __contains__(self, target):
         """Check whether BST contains target value."""
         node = self.root
-        while node:
+        while not node:
             if target < node.value :
                 node = node.left
             elif target > node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F....F.F. [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.....F [ 53%]
.F.FFFFFFFFFFFFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:21: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:57: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:71: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:91: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:117: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:138: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:188: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:206: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:221: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:241: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:263: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:283: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:300: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:324: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:341: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:363: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
>       var_1 = binary_tree_0.__contains__(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:380: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:8: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:24: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:34: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:79: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:130: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:168: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:209: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:216: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:234: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:252: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:270: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:286: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:304: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:326: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:354: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:429: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:449: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:476: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.__contains__(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:193: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def __contains__(self, target):
        """Check whether BST contains target value."""
        node = self.root
        while not node:
>           if target < node.value :
E           AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:122: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 42 failed, 44 passed in 0.76s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -119,7 +119,7 @@
         """Check whether BST contains target value."""
         node = self.root
         while node:
-            if target < node.value :
+            if not target < node.value :
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...F.FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..FF...........FF.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
.....FF...F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 20 failed, 66 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -133,7 +133,7 @@
         Return value closest to target. If there are several, then
         return one of them.
         """
-        if self.root is None:
+        if not self.root is None:
             return None
         
         best = node = self.root

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py .......F... [ 12%]
.FF..F..FFFFF..FFFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..F.F....F.F..F [ 53%]
...F..FFF.FFFFF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..F..FFF..F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:56: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.closest(var_2)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:98: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
        assert var_3 is True
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:111: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:151: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:187: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:205: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:240: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:262: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:317: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:323: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:340: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:362: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:379: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = binary:()

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:36: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_4 __________________________________

    def test_case_4():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = False
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.closest(bool_0)
>       assert var_1 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        float_0 = 1747.362
        dict_0 = {float_0: float_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(dict_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:87: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {1747.362: 1747.362}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
>       var_0 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:97: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_node_0.add(var_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:135: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_0)
>       assert var_3 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:204: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:237: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:254: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:272: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       var_1 = binary_tree_0.closest(none_type_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:306: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = None

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        binary_node_0 = module_0.BinaryNode(var_0)
        var_1 = binary_tree_0.remove(var_0)
>       var_2 = binary_tree_0.closest(var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:358: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = False

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
>       assert var_8 == 427
E       assert None == 427

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:398: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        bytes_0 = b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'
        set_0 = {bytes_0, bytes_0, bytes_0}
        binary_tree_0 = module_0.BinaryTree()
>       var_0 = binary_tree_0.closest(set_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:102: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:(), target = {b'\xd5\x1aDT\x1bg\xd27\xd3\\\x13\xba'}

    def closest(self, target):
        """
        Return value closest to target. If there are several, then
        return one of them.
        """
        if not self.root is None:
            return None
    
        best = node = self.root
>       distance = abs(self.root.value - target)
E       AttributeError: 'NoneType' object has no attribute 'value'

binarySearchTree1.py:140: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
>       assert var_3 is True
E       assert None is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:174: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.getMin()
        assert var_3 is False
        var_4 = binary_tree_0.closest(var_2)
>       assert var_4 is False
E       assert None is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:203: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_4
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_10
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 35 failed, 51 passed in 0.67s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -138,7 +138,7 @@
         
         best = node = self.root
         distance = abs(self.root.value - target)
-        while node:
+        while not node:
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
...........FF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...........F.FF.FF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__contains__(var_0)
        var_2 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(var_2)
        assert f'{type(binary_node_0.value).__module__}.{type(binary_node_0.value).__qualname__}' == 'builtins.generator'
        var_3 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_2.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.remove(bool_0)
        var_8 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_8).__module__}.{type(var_8).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_8.root).__module__}.{type(var_8.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_9 = var_6.__repr__()
        assert var_9 == '427'
        var_10 = binary_tree_0.closest(var_0)
>       assert var_10 is False
E       assert 427 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:349: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
        assert var_7 is True
        var_8 = binary_tree_0.closest(int_0)
        assert var_8 == 427
        bool_1 = True
        var_9 = binary_tree_0.add(bool_1)
        var_10 = var_6.closest(bool_1)
>       assert var_10 is True
E       assert 427 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:402: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
        assert var_6 is True
        var_7 = var_4.remove(var_2)
        var_8 = binary_tree_0.closest(var_6)
>       assert var_8 is True
E       assert 1625 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:425: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
        assert var_12 is True
        var_13 = var_10.remove(var_8)
        var_14 = binary_tree_0.closest(var_0)
>       assert var_14 is False
E       assert 1656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:501: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
========================= 9 failed, 77 passed in 0.37s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -139,7 +139,7 @@
         best = node = self.root
         distance = abs(self.root.value - target)
         while node:
-            if abs(node.value - target) < distance:
+            if not abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
             if target < node.value:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.23s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -142,7 +142,7 @@
             if abs(node.value - target) < distance:
                 distance = abs(node.value - target)
                 best = node
-            if target < node.value:
+            if not target < node.value:
                 node = node.left
             elif target > node.value:
                 node = node.right

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..........FFF.....FF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..........F.....F.                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FFF......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = -201
        var_7 = binary_tree_0.closest(int_0)
>       assert var_7 is False
E       assert -201 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:236: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:251: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:273: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:373: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
>       assert var_7 is True
E       assert -4493 is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:392: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_2 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = var_4.__repr__()
        var_8 = binary_tree_0.closest(var_0)
>       assert var_8 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:322: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
        assert var_10 is True
        var_11 = var_9.remove(var_7)
        var_12 = binary_tree_0.closest(var_0)
>       assert var_12 is False
E       assert -2656 is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:471: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:139: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:158: AssertionError
_________________________________ test_case_15 _________________________________

    def test_case_15():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        bool_1 = True
        var_0 = binary_node_0.addToSubTree(binary_node_0, bool_0)
        assert f'{type(binary_node_0.left).__module__}.{type(binary_node_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_0.left).__module__}.{type(var_0.left).__qualname__}' == 'binarySearchTree1.BinaryNode'
        binary_tree_0 = module_0.BinaryTree()
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.add(bool_0)
        var_3 = binary_tree_0.closest(bool_1)
        assert var_3 is True
        bool_2 = False
        var_4 = binary_tree_0.getMax()
        assert var_4 is True
        var_5 = binary_tree_0.closest(bool_2)
>       assert var_5 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:179: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_15
======================== 10 failed, 76 passed in 0.36s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -153,7 +153,7 @@
 
     def __iter__(self):
         """In order traversal of elements in the tree."""
-        if self.root:
+        if not self.root:
             for e in self.root.inorder():
                 yield e
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....F...............                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
....F.............                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FF.......                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_15 _________________________________

    def test_case_15():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(none_type_0)
>       object_0 = module_1.object(*var_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:132: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
>       object_0 = module_1.object(*binary_tree_0)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:211: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:141: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
        assert var_1 is False
        bool_2 = False
        set_0 = {bool_2}
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.closest(bool_2)
        assert var_3 is True
        binary_tree_1 = module_0.BinaryTree()
>       object_0 = module_1.object(*binary_tree_1)

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:160: 
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ 

self = binary:()

    def __iter__(self):
        """In order traversal of elements in the tree."""
        if not self.root:
>           for e in self.root.inorder():
E           AttributeError: 'NoneType' object has no attribute 'inorder'

binarySearchTree1.py:157: AttributeError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_15
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
========================= 4 failed, 82 passed in 0.30s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -158,7 +158,7 @@
                 yield e
 
     def __repr__(self):
-        if self.root is None:
+        if not self.root is None:
             return "binary:()"
         return "binary:" + str(self.root)
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........FF. [ 12%]
.....FF....F.F...F.F                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ..........FF... [ 53%]
..F..........F.FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py F....... [ 83%]
..............                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        var_1 = binary_tree_0.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:64: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:77: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
        assert var_6 is True
        int_0 = 451
        var_7 = binary_tree_0.closest(int_0)
        assert var_7 is False
        var_8 = var_2.__repr__()
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:154: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
        assert var_2 is True
        var_3 = binary_tree_0.getMax()
        assert var_3 is False
        var_4 = var_1.__repr__()
        var_5 = binary_tree_0.__contains__(var_2)
        assert var_5 is False
        var_6 = binary_tree_0.add(var_5)
        var_7 = binary_tree_0.remove(var_3)
        var_8 = binary_tree_0.__repr__()
>       assert var_8 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:174: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
        assert var_3 is True
        var_4 = binary_tree_0.add(var_3)
        var_5 = binary_tree_0.getMax()
        assert var_5 is True
        var_6 = binary_tree_0.closest(var_5)
        assert var_6 is True
        var_7 = var_2.__repr__()
        var_8 = binary_tree_0.add(var_6)
        var_9 = binary_tree_0.__repr__()
>       assert var_9 == 'binary:(L: False R:(L:(L: True R:) True R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: F...R:) True R:))'
E         - binary:(L: False R:(L:(L: True R:) True R:))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:255: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.getMax()
        assert var_4 is False
        var_5 = var_3.__repr__()
        var_6 = binary_tree_0.__repr__()
>       assert var_6 == 'binary:(L:(L: False R:) False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:) False R:)'
E         - binary:(L:(L: False R:) False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:292: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 == 3380
        var_7 = binary_tree_0.closest(var_6)
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = binary_tree_0.remove(var_7)
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L:(L: False R:(L: True R:)) 3380 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L...R:)) 3380 R:)'
E         - binary:(L:(L: False R:(L: True R:)) 3380 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:357: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
        assert var_4 is True
        var_5 = binary_tree_0.add(var_4)
        var_6 = binary_tree_0.getMax()
        assert var_6 is True
        var_7 = binary_tree_0.closest(var_6)
        assert var_7 is True
        var_8 = var_3.__repr__()
        var_9 = binary_tree_0.add(var_7)
        var_10 = module_1.object()
        var_11 = binary_tree_0.__repr__()
>       assert var_11 == 'binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...:) True R:)))'
E         - binary:(L: -4493 R:(L: False R:(L:(L: True R:) True R:)))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:397: AssertionError
_________________________________ test_case_10 _________________________________

    def test_case_10():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:92: AssertionError
_________________________________ test_case_11 _________________________________

    def test_case_11():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.closest(none_type_0)
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is True
        var_3 = binary_tree_0.remove(bool_0)
        assert binary_tree_0.root is None
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = binary_tree_0.__repr__()
>       assert var_5 == 'binary:(L: True R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: True R:)'
E         - binary:(L: True R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:111: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
>       assert var_0 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:180: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
>       assert var_2 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:385: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
>       assert var_3 == 'binary:(L: False R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L: False R:)'
E         - binary:(L: False R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:436: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
E       AssertionError: assert 'binary:()' == 'binary:(L: -...L: False R:))'
E         - binary:(L: -2656 R:(L: False R:))
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:459: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
>       assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
E       AssertionError: assert 'binary:()' == 'binary:(L:(L... R:) 1656 R:)'
E         - binary:(L:(L: False R:) 1656 R:)
E         + binary:()

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:485: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        bool_0 = True
        list_0 = [bool_0]
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(list_0)
        binary_tree_1 = module_0.BinaryTree()
        binary_tree_2 = module_0.BinaryTree()
        var_1 = binary_tree_2.__repr__()
>       assert var_1 == 'binary:()'
E       AssertionError: assert 'binary:None' == 'binary:()'
E         - binary:()
E         + binary:None

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:15: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_10
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_11
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_0
======================== 16 failed, 70 passed in 0.43s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -124,7 +124,7 @@
             elif target > node.value:
                 node = node.right
             else:
-                return True
+                return False
                 
         return False
 

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
..FF.FF.FFFFF...FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
...F.........FFFFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ..F..... [ 83%]
..........F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:109: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 is False
        var_3 = binary_tree_0.__contains__(var_2)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:124: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = var_1.__repr__()
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:148: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:165: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:193: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:211: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.remove(binary_tree_0)
        var_2 = binary_tree_0.__contains__(var_1)
        var_3 = binary_tree_0.add(var_2)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = binary_tree_0.getMin()
        assert var_4 is False
        var_5 = binary_tree_0.getMax()
        assert var_5 is False
        binary_tree_1 = module_0.BinaryTree()
        var_6 = binary_tree_0.__contains__(var_5)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:233: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:246: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:268: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:329: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = 3380
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:348: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        var_2 = binary_tree_0.add(var_1)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__contains__(var_1)
>       assert var_3 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:368: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
        assert var_1 is False
        int_0 = -4493
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_1)
        var_4 = binary_tree_0.__contains__(var_1)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:387: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(none_type_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.getMax()
        assert var_1 is False
        var_2 = binary_tree_0.__contains__(var_1)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:202: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__iter__()
        bool_0 = False
        binary_node_0 = module_0.BinaryNode(bool_0)
        var_1 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__repr__()
        assert var_2 == 'binary:(L: False R:)'
        int_0 = 427
        var_3 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_3).__module__}.{type(var_3).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_3.root).__module__}.{type(var_3.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_4 = var_0.__repr__()
        var_5 = binary_tree_0.remove(bool_0)
        var_6 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_6).__module__}.{type(var_6).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_6.root).__module__}.{type(var_6.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_7 = binary_tree_0.__contains__(bool_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:396: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(binary_tree_0)
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        int_0 = 1625
        var_1 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_1).__module__}.{type(var_1).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_1.root).__module__}.{type(var_1.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.getMax()
        assert var_2 == 1625
        var_3 = binary_tree_0.remove(bool_0)
        var_4 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_4.add(var_2)
        var_6 = binary_tree_0.__contains__(bool_0)
>       assert var_6 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:422: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.__iter__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.__repr__()
        assert var_3 == 'binary:(L: False R:)'
        int_0 = 427
        var_4 = binary_node_0.addToSubTree(binary_tree_0, int_0)
        assert f'{type(var_4).__module__}.{type(var_4).__qualname__}' == 'binarySearchTree1.BinaryTree'
        assert f'{type(var_4.root).__module__}.{type(var_4.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_5 = var_1.__repr__()
        var_6 = binary_tree_0.getMax()
        assert var_6 == 427
        var_7 = binary_tree_0.__contains__(int_0)
>       assert var_7 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:445: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        int_0 = -2656
        var_1 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        bool_0 = False
        var_2 = var_0.__repr__()
        binary_node_0 = module_0.BinaryNode(var_0)
        var_3 = binary_tree_0.add(bool_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L: -2656 R:(L: False R:))'
        int_1 = 1625
        var_5 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_6 = var_0.__repr__()
        var_7 = binary_tree_0.getMax()
        assert var_7 == 1625
        var_8 = binary_tree_0.remove(bool_0)
        var_9 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_10 = binary_tree_0.__contains__(bool_0)
>       assert var_10 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:468: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        bool_0 = True
        var_1 = var_0.__repr__()
        int_0 = 1656
        var_2 = binary_tree_0.add(int_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.add(var_0)
        var_4 = binary_tree_0.__repr__()
        assert var_4 == 'binary:(L:(L: False R:) 1656 R:)'
        binary_node_0 = module_0.BinaryNode(var_0)
        var_5 = binary_tree_0.__repr__()
        assert var_5 == 'binary:(L:(L: False R:) 1656 R:)'
        int_1 = 1625
        var_6 = binary_node_0.addToSubTree(binary_tree_0, int_1)
        var_7 = var_0.__repr__()
        var_8 = binary_tree_0.getMax()
        assert var_8 == 1656
        var_9 = binary_tree_0.remove(bool_0)
        var_10 = binary_node_0.addToSubTree(binary_tree_0, bool_0)
        var_11 = var_10.add(var_8)
        var_12 = binary_tree_0.__contains__(bool_0)
>       assert var_12 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:498: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        list_0 = []
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(list_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_1 = binary_tree_0.add(list_0)
        var_2 = binary_tree_0.add(list_0)
        var_3 = binary_tree_0.getMin()
        binary_node_0 = module_0.BinaryNode(var_2)
        var_4 = binary_tree_0.__contains__(list_0)
>       assert var_4 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:34: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
        assert var_0 is False
        var_1 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_2 = binary_tree_0.__contains__(var_0)
>       assert var_2 is True
E       assert False is True

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:198: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_18
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 21 failed, 65 passed in 0.44s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -126,7 +126,7 @@
             else:
                 return True
                 
-        return False
+        return True
 
     def closest(self, target):
         """

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ..F....F.F. [ 12%]
.FFF.FF.FFFFFFF.FFFF                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py FFF.....F.....F [ 53%]
.FF.FFFFFFFFF..FFF                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
.....FF...F...                                                           [100%]

=================================== FAILURES ===================================
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:22: AssertionError
_________________________________ test_case_7 __________________________________

    def test_case_7():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:58: AssertionError
_________________________________ test_case_9 __________________________________

    def test_case_9():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:72: AssertionError
_________________________________ test_case_12 _________________________________

    def test_case_12():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:92: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:103: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:118: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:139: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:161: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:189: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:207: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:222: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:242: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:264: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.remove(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:284: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:301: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:325: AssertionError
_________________________________ test_case_28 _________________________________

    def test_case_28():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:342: AssertionError
_________________________________ test_case_29 _________________________________

    def test_case_29():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:364: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.closest(binary_tree_0)
        var_1 = binary_tree_0.__contains__(var_0)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py:381: AssertionError
_________________________________ test_case_0 __________________________________

    def test_case_0():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:9: AssertionError
_________________________________ test_case_1 __________________________________

    def test_case_1():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:25: AssertionError
_________________________________ test_case_2 __________________________________

    def test_case_2():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(none_type_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:35: AssertionError
_________________________________ test_case_8 __________________________________

    def test_case_8():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:80: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:131: AssertionError
_________________________________ test_case_16 _________________________________

    def test_case_16():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:169: AssertionError
_________________________________ test_case_17 _________________________________

    def test_case_17():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__repr__()
        assert var_0 == 'binary:()'
        var_1 = var_0.__repr__()
        assert var_1 == "'binary:()'"
        var_2 = binary_tree_0.add(var_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        var_3 = binary_tree_0.getMax()
        assert var_3 == 'binary:()'
        var_4 = binary_tree_0.__iter__()
        var_5 = binary_tree_0.__contains__(var_1)
>       assert var_5 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:189: AssertionError
_________________________________ test_case_19 _________________________________

    def test_case_19():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:210: AssertionError
_________________________________ test_case_20 _________________________________

    def test_case_20():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:217: AssertionError
_________________________________ test_case_21 _________________________________

    def test_case_21():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:235: AssertionError
_________________________________ test_case_22 _________________________________

    def test_case_22():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:253: AssertionError
_________________________________ test_case_23 _________________________________

    def test_case_23():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:271: AssertionError
_________________________________ test_case_24 _________________________________

    def test_case_24():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:287: AssertionError
_________________________________ test_case_25 _________________________________

    def test_case_25():
        binary_tree_0 = module_0.BinaryTree()
        none_type_0 = None
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:305: AssertionError
_________________________________ test_case_26 _________________________________

    def test_case_26():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:327: AssertionError
_________________________________ test_case_27 _________________________________

    def test_case_27():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:355: AssertionError
_________________________________ test_case_30 _________________________________

    def test_case_30():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:430: AssertionError
_________________________________ test_case_31 _________________________________

    def test_case_31():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:450: AssertionError
_________________________________ test_case_32 _________________________________

    def test_case_32():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py:477: AssertionError
_________________________________ test_case_13 _________________________________

    def test_case_13():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:133: AssertionError
_________________________________ test_case_14 _________________________________

    def test_case_14():
        bool_0 = True
        binary_node_0 = module_0.BinaryNode(bool_0)
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.add(bool_0)
        assert f'{type(binary_tree_0.root).__module__}.{type(binary_tree_0.root).__qualname__}' == 'binarySearchTree1.BinaryNode'
        none_type_0 = None
        bool_1 = False
        var_1 = binary_tree_0.__contains__(bool_1)
>       assert var_1 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:152: AssertionError
_________________________________ test_case_18 _________________________________

    def test_case_18():
        binary_tree_0 = module_0.BinaryTree()
        var_0 = binary_tree_0.__contains__(binary_tree_0)
>       assert var_0 is False
E       assert True is False

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py:194: AssertionError
=========================== short test summary info ============================
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_7
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_9
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_12
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_28
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_29
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_0
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_1
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_2
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_8
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_16
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_17
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_19
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_20
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_21
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_22
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_23
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_24
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_25
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_26
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_27
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_30
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_31
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py::test_case_32
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_13
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_14
FAILED DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py::test_case_18
======================== 41 failed, 45 passed in 0.66s =========================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -70,7 +70,7 @@
     def inorder(self):
         """In order traversal generator of tree rooted at given node."""
         if self.left:
-            for v in self.left.inorder():
+            for v in []:
                 yield v
 
         yield self.value

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -76,7 +76,7 @@
         yield self.value
 
         if self.right:
-            for v in self.right.inorder():
+            for v in []:
                 yield v
 
 class BinaryTree:

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.26s ==============================

--- mutation diff ---
--- abinarySearchTree1.py
+++ bbinarySearchTree1.py
@@ -154,7 +154,7 @@
     def __iter__(self):
         """In order traversal of elements in the tree."""
         if self.root:
-            for e in self.root.inorder():
+            for e in []:
                 yield e
 
     def __repr__(self):

============================= test session starts ==============================
platform linux -- Python 3.10.10, pytest-7.2.1, pluggy-1.0.0
rootdir: /home/auri/temp/lucca/python_experiments/binarySearchTree1
collected 86 items

DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_DYNAMOSA.py ........... [ 12%]
....................                                                     [ 36%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_MOSA.py ............... [ 53%]
..................                                                       [ 74%]
DYNAMOSA-MOSA-WHOLE_SUITE/test_binarySearchTree1_WHOLE_SUITE.py ........ [ 83%]
..............                                                           [100%]

============================== 86 passed in 0.24s ==============================